Relational e-matching

We present a new approach to e-matching based on relational join; in particular, we apply recent database query execution techniques guarantee worst-case optimal run time. Compared the conventional backtracking that always searches e-graph "top down", our can better exploit pattern structure by searching according an optimized plan. also establish first data complexity result for e-matching, bounding time as function of size and output size. prototyped evaluated technique state-of-the-art egg framework. baseline, is simpler implement orders magnitude faster practice.